\hypertarget{mergesort_8h}{}\section{src/sort\+\_\+algorithms/merge\+\_\+sort/mergesort.h File Reference}
\label{mergesort_8h}\index{src/sort\+\_\+algorithms/merge\+\_\+sort/mergesort.\+h@{src/sort\+\_\+algorithms/merge\+\_\+sort/mergesort.\+h}}
{\ttfamily \#include $<$vector$>$}\\*
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_sort_algorithm}{Introduction\+To\+Algorithm\+::\+Sort\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_sort_algorithm}{Sort\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Iterator , typename Compare\+Type  = std\+::less$<$typename std\+::iterator\+\_\+traits$<$\+Iterator$>$\+::value\+\_\+type$>$$>$ }\\void \hyperlink{namespace_introduction_to_algorithm_1_1_sort_algorithm_a4806cf41bd25ff1d1344d858a7a5b577}{Introduction\+To\+Algorithm\+::\+Sort\+Algorithm\+::merge} (const Iterator begin, const Iterator end, const Iterator middle, Compare\+Type compare=Compare\+Type())
\begin{DoxyCompactList}\small\item\em merge：算法导论第二章 2.\+3.\+1 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Iterator , typename Compare\+Type  = std\+::less$<$typename std\+::iterator\+\_\+traits$<$\+Iterator$>$\+::value\+\_\+type$>$$>$ }\\void \hyperlink{namespace_introduction_to_algorithm_1_1_sort_algorithm_a38dce6f6996c858aef1096d75bb785db}{Introduction\+To\+Algorithm\+::\+Sort\+Algorithm\+::merge\+\_\+sort} (const Iterator begin, const Iterator end, Compare\+Type compare=Compare\+Type())
\begin{DoxyCompactList}\small\item\em merge\+\_\+sort：算法导论第二章 2.\+3.\+1 \end{DoxyCompactList}\end{DoxyCompactItemize}
